Recursive stochastic games with positive rewards
نویسندگان
چکیده
منابع مشابه
Recursive Stochastic Games with Positive Rewards
We study the complexity of a class of Markov decision processes and, more generally, stochastic games, called 1-exit Recursive Markov Decision Processes (1-RMDPs) and Simple Stochastic Games (1-RSSGs) with strictly positive rewards. These are a class of finitely presented countable-state zero-sum stochastic games, with total expected reward objective. They subsume standard finite-state MDPs and...
متن کاملRecursive Concurrent Stochastic Games
We study Recursive Concurrent Stochastic Games (RCSGs), extending our recent analysis of recursive simple stochastic games [14, 15] to a concurrent setting where the two players choose moves simultaneously and independently at each state. For multi-exit games, our earlier work already showed undecidability for basic questions like termination, thus we focus on the important case of single-exit ...
متن کاملThe Adaptive Knapsack Problem with Stochastic Rewards
Given a set of items with associated deterministic weights and random rewards, the Adaptive Stochastic Knapsack Problem (Adaptive SKP) maximizes the probability of reaching a predetermined target reward level when items are inserted sequentially into a capacitated knapsack before the reward of each item is realized. This model arises in resource allocation problems which permit or require seque...
متن کاملRecursive Repeated Games with Absorbing States
We show the existence of stationary limiting average "-equilibria (" > 0) for two-person recursive repeated games with absorbing states. These are stochastic games where all states but one are absorbing, and in the non-absorbing state all payoos are equal to zero. A state is called absorbing, if the probability of a transition to any other state is zero for all available pairs of actions. For t...
متن کاملGames for Recursive Types
We present results concerning the solution of recursive domain equations in the category G of games, which is a modiied version of the category presented in AJM94]. New constructions corresponding to lifting and separated sum for games are presented, and are used to generate games for two simple recursive types: the vertical and lazy natural numbers. Recently, the \game semantics" paradigm has ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2018.12.018